Efficient pairing computation with theta functions

The original publication is available at www.springerlink.comInternational audienceIn this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's algorithm, is its generality since it extends to all abelian varieties the classical Weil and Tate pairing formulas. In the case of dimension $1$ and $2$ abelian varieties our algorithms lead to implementations which are efficient and naturally deterministic. We also introduce symmetric Weil and Tate pairings on Kummer varieties and explain how to compute them efficiently. We exhibit a nice algorithmic compatibility between some algebraic groups quotiented by the action of the automorphism $-1$, where the $\Z$-action can be computed efficiently with a Montgomery ladder type algorithm

Counting Points on Genus 2 Curves with Real Multiplication

We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field (\F_{q}) of large characteristic from (\widetilde{O}(\log^8 q)) to (\widetilde{O}(\log^5 q)). Using our algorithm we compute a 256-bit prime-order Jacobian, suitable for cryptographic applications, and also the order of a 1024-bit Jacobian

MEMO: mass spectrometry-based sample vectorization to explore chemodiverse datasets

In natural products research, chemodiverse extracts coming from multiple organisms are explored for novel bioactive molecules, sometimes over extended periods. Samples are usually analyzed by liquid chromatography coupled with fragmentation mass spectrometry to acquire informative mass spectral ensembles. Such data is then exploited to establish relationships among analytes or samples (e.g., via molecular networking) and annotate metabolites. However, the comparison of samples profiled in different batches is challenging with current metabolomics methods since the experimental variation-changes in chromatographical or mass spectrometric conditions - hinders the direct comparison of the profiled samples. Here we introduce MEMO-MS2 BasEd SaMple VectOrization-a method allowing to cluster large amounts of chemodiverse samples based on their LC-MS/MS profiles in a retention time agnostic manner. This method is particularly suited for heterogeneous and chemodiverse sample sets. MEMO demonstrated similar clustering performance as state-of-the-art metrics considering fragmentation spectra. More importantly, such performance was achieved without the requirement of a prior feature alignment step and in a significantly shorter computational time. MEMO thus allows the comparison of vast ensembles of samples, even when analyzed over long periods of time, and on different chromatographic or mass spectrometry platforms. This new addition to the computational metabolomics toolbox should drastically expand the scope of large-scale comparative analysis

Testing Hardy nonlocality proof with genuine energy-time entanglement

We show two experimental realizations of Hardy ladder test of quantum nonlocality using energy-time correlated photons, following the scheme proposed by A. Cabello \emph{et al.} [Phys. Rev. Lett. \textbf{102}, 040401 (2009)]. Unlike, previous energy-time Bell experiments, these tests require precise tailored nonmaximally entangled states. One of them is equivalent to the two-setting two-outcome Bell test requiring a minimum detection efficiency. The reported experiments are still affected by the locality and detection loopholes, but are free of the post-selection loophole of previous energy-time and time-bin Bell tests.Comment: 5 pages, revtex4, 6 figure

Proenkephalin A 119-159 (Penkid) Is an Early Biomarker of Septic Acute Kidney Injury: The Kidney in Sepsis and Septic Shock (Kid-SSS) Study

Introduction: Sepsis is the leading cause of acute kidney injury (AKI) in critically ill patients. The Kidney in Sepsis and Septic Shock (Kid-SSS) study evaluated the value of proenkephalin A 119-159 (penkid)—a sensitive biomarker of glomerular function, drawn within 24 hours upon intensive care unit (ICU) admission and analyzed using a chemiluminescence immunoassay—for kidney events in sepsis and septic shock. Methods: The Kid-SSS study was a substudy of Adrenomedullin and Outcome in Severe Sepsis and Septic Shock (AdrenOSS) (NCT02393781), a prospective, observational, multinational study including 583 patients admitted to the intensive care unit with sepsis or septic shock and a validation cohort of 525 patients from the French and euRopean Outcome reGistry in Intensive Care Units (FROG-ICU) study. The primary endpoint was major adverse kidney events (MAKEs) at day 7, composite of death, renal replacement therapy, and persistent renal dysfunction. The secondary endpoints included AKI, transient AKI, worsening renal function (WRF), and 28-day mortality. Results: Median age was 66 years (interquartile range 55–75), and 28-day mortality was 22% (95% confidence interval [CI] 19%−25%). Of the patients, 293 (50.3%) were in shock upon ICU admission. Penkid was significantly elevated in patients with MAKEs, persistent AKI, and WRF (median = 65 [IQR = 45–106] vs. 179 [114–242]; 53 [39–70] vs. 133 [79–196] pmol/l; and 70 [47–121] vs. 174 [93–242] pmol/l, all P < 0.0001), also after adjustment for confounding factors (adjusted odds ratio = 3.3 [95% CI = 1.8–6.0], 3.9 [95% CI = 2.1–7.2], and 3.4 [95% CI = 1.9–6.2], all P < 0.0001). Penkid increase preceded elevation of serum creatinine with WRF and was low in renal recovery. Conclusion: Admission penkid concentration was associated with MAKEs, AKI, and WRF in a timely manner in septic patients

Efficient Doubling on Genus Two Curves over Binary Fields

In most algorithms involving elliptic and hyperelliptic curves, the costliest part consists in computing multiples of ideal classes. This paper investigates how to compute faster doubling over fields of characteristic two. We derive explicit doubling formulae making strong use of the defining equation of the curve. We analyze how many field operations are needed depending on the curve making clear how much generality one loses by the respective choices. Note, that none of the proposed types is known to be weak – one only could be suspicious because of the more special types. Our results allow to choose curves from a large enough variety which have extremely fast doubling needing only half the time of an addition. Combined with a sliding window method this leads to fast computation of scalar multiples. We also speed up the general case

Making Password Authenticated Key Exchange Suitable For Resource-Constrained Industrial Control Devices

Connectivity becomes increasingly important also for small embedded systems such as typically found in industrial control installations. More and more use-cases require secure remote user access increasingly incorporating handheld based human machine interfaces, using wireless links such as Bluetooth. Correspondingly secure operator authentication becomes of utmost importance. Unfortunately, often passwords with all their well-known pitfalls remain the only practical mechanism. We present an assessment of the security requirements for the industrial setting, illustrating that offline attacks on passwords-based authentication protocols should be considered a significant threat. Correspondingly use of a Password Authenticated Key Exchange protocol becomes desirable. We review the signif-icant challenges faced for implementations on resource-constrained devices. We explore the design space and shown how we succeeded in tailoring a partic-ular variant of the Password Authenticated Connection Establishment (PACE) protocol, such that acceptable user interface responsiveness was reached even for the constrained setting of an ARM Cortex-M0+ based Bluetooth low-energy transceiver running from a power budget of 1.5 mW without notable energy buffers for covering power peak transients